Freight Consolidation Problem with Time Windows, Pickup and Delivery Sequence
نویسندگان
چکیده
منابع مشابه
Branch and Cut and Price for the Pickup and Delivery Problem with Time Windows
In the pickup and delivery problem with time windows (PDPTW), vehicle routes must be designed to satisfy a set of transportation requests, each involving a pickup and a delivery location, under capacity, time window, and precedence constraints. This paper introduces a new branch-and-cut-and-price algorithm in which lower bounds are computed by solving through column generation the linear progra...
متن کاملA branch-and-price algorithm for the pickup and delivery problem with time windows
In pickup and delivery problems vehicles have to transport loads from origins to destinations without transshipment at intermediate locations. In this paper, we describe an algorithm to solve such problems. The algorithm is based on a set partitioning formulation of the problem and uses new column generation and branching schemes.
متن کاملHybrid MIP method for a Pickup and Delivery Problem with Time Windows and Dock Service Constraints
We consider a pickup and delivery vehicle routing problem (PDP) commonly find in real-world logistics operations. The problem includes a set of practical complications that have received little attention in the vehicle routing literature. In this problem, there are multiple vehicle types available to cover a set of transportation orders, each of which has pickup time windows and delivery time...
متن کاملMulti-trip pickup and delivery problem with time windows and synchronization
In this paper, we consider two-tier City Logistics systems accounting for both the inbound and outbound traffic that have not been taken into account in models and algorithms for vehicle routing research. The problem under study, called the Multi-zone Multi-trip Pickup and Delivery Problem with Time Windows and Synchronization, has two sets of intertwined decisions: the routing decisions which ...
متن کاملSolving the Pickup and Delivery Problem with Time Windows by Branch-and-Cut
In the Vehicle Routing Problem with Pickup and Delivery (VRPPD), a set of transportation requests must be satisfied by capacitated vehicles based at one or several depots. Each request is defined by an origin (or pickup point), a destination (or delivery point), and a demand to be transported from the origin to the destination. Typical applications are parcel services and dial-a-ride transporta...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: MATEC Web of Conferences
سال: 2019
ISSN: 2261-236X
DOI: 10.1051/matecconf/201927106005